#include <stdio.h>

void ShellSort(int* a, int n)
{
	int gab = n;
	while (gab > 1)
	{
		gab = gab / 2;
		for (int i = 0; i < n - gab ; i++)
		{
			int end = i;
			int tmp = a[end + gab];
			while (end >= 0)
			{
				if (a[end] > tmp)
				{
					a[end + gab] = a[end];
					end -= gab;
				}
				else
				{
					break;
				}
				a[end + gab] = tmp;
			}
			
		}
	}



}

int main()
{
	return 0;
}